Generalized domination, independence and irredudance in graphs
نویسندگان
چکیده
The purpose of this paper is to present some basic properties of P-dominating, P-independent, and P-irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملParameters of independence and domination by monochromatic paths in graphs
In this paper we generalize parameters of independence and domination for graphs. The behavior of parameters for independence and domination by monochromatic paths is studied when an edge or a vertex is deleted. Then we give main results concerning μ-feasible sequences and interpolation.
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملClasses of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance
This paper investigates cases where one graph parameter, upper fractional domination, is equal to three others: independence, upper domination and upper irredundance. We show that they are all equal for a large subclass, known as strongly perfect graphs, of the class of perfect graphs. They are also equal for odd cycles and upper bound graphs. However for simplicial graphs, upper irredundance m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1997